Simple refutation of Joy Christian’s simple refutation of Bell’s simple theorem
نویسنده
چکیده
I point out a simple algebraic error in Joy Christian’s refutation of Bell’s theorem. In substituting the result of multiplying some derived bivectors with one another by consultation of their multiplication table, he confuses the generic vectors which he used to define the table, with other specific vectors having a special role in the paper, which had been introduced earlier. The result should be expressed in terms of the derived bivectors which indeed do follow this multiplication table. When correcting this calculation, the result is not the singlet correlation any more. Moreover, curiously, his normalized correlations are independent of the number of measurements and certainly do not require letting n converge to infinity. At the same time, his unnormalized or raw correlations are identically equal to −1, independently of the number of measurements! Correctly computed, his standardized correlations are the bivectors −a · b − a ∧ b, and they find their origin entirely in his normalization or standardization factors. I conclude that his research program has been set up around an elaborately hidden but trivial mistake. In at least 11 papers on quant-ph author Joy Christian proposes a local hidden variables model for quantum correlations which disproves Bell’s theorem “by counterexample” in a number of different settings, including the famous CHSH and GHZ versions. Fortunately one of these papers is just one page long and concentrates on the mathematical heart of his work. Unfortunately for his grand project, this version enables us to clearly see a rather shorter derivation of the desired correlations, which exposes an error in his own derivation. The error is connected with an unfortunate notational ambiguity at the very start of the paper. In a nutshell: the same symbols are used to denote both a certain fixed basis (βj, j = 1, 2, 3) in terms of which two other bases are defined, (βj(+1), j = 1, 2, 3) and (βj(−1), j = 1, 2, 3), as well as to express the generic algebraic multiplication rules which these latter two bases satisfy. This tiny ambiguity, though harmless locally, is probably the reason why later on, when apparently using the multiplication tables for the new bases, he silently shifts from the derived bases to the original special basis.
منابع مشابه
Refutation of Richard Gill’s Argument Against my Disproof of Bell’s Theorem
I identify a number of errors in Richard Gill’s purported refutation of my disproof of Bell’s theorem. In particular, I point out that his central argument is based, not only on a rather trivial misreading of my counterexample to Bell’s theorem, but also on a simple oversight of a freedom of choice in the orientation of a Clifford algebra. What is innovative and original in my counterexample is...
متن کاملPolynomial Time Algorithm Solving the Refutation Tree Problem for Formal Graph Systems
The refutation tree problem is to compute a refutation tree which is associated with the structure of a graph generated by a formal graph system (FGS).We present subclasses of FGSs, called simple FGSs, size-bounded simple FGSs and bounded simple FGSs. In order to show that the refutation tree problem for simple FGSs can be solved in polynomial time, we prove that the refutation tree problem for...
متن کاملRefutation of Some Arguments Against my Disproof of Bell’s Theorem
In a couple of recent preprints Moldoveanu has suggested that there are errors in my disproof of Bell’s theorem. Here I show that this claim is false. In particular, I show that my local-realistic framework is incorrectly and misleadingly presented in both of his preprints. In addition there are a number of serious mathematical and conceptual errors in his discussion of my framework. For exampl...
متن کامل6 v 1 1 3 A ug 2 00 2 Classical information and Mermin ’ s non - technical proof of the theorem of Bell
We show that Mermin’s reasoning against our refutation of his non-technical proof for Bell-type inequalities is of limited significance or contains mathematical inconsistencies that, when taken into account, do not permit his proof to go forward. Our refutation therefore stands. We discuss two recent notes of Mermin [1], [2] that deal with our refutation [3] of Mermin’s non-technical proof [4] ...
متن کاملProof and Refutation in Formal Software Development
In this paper we describe investigations into the use of automatic theorem proving technology in the refutation of proof obligations. Specifically, we discuss the use of resolution based theorem proving and model checking to find false obligations and counterexamples. These techniques can be used as basis of an automatic method for finding faults in design during the formal development of softw...
متن کامل